Secret Sharing and Non-Shannon Information Inequalities
نویسندگان
چکیده
منابع مشابه
Non-Shannon Information Inequalities in Four Random Variables
Any unconstrained information inequality in three or fewer random variables can be written as a linear combination of instances of Shannon’s inequality I(A;B|C) ≥ 0. Such inequalities are sometimes referred to as “Shannon” inequalities. In 1998, Zhang and Yeung gave the first example of a “nonShannon” information inequality in four variables. Their technique was to add two auxiliary variables w...
متن کاملSecret Sharing and Shared Information
Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, the...
متن کاملNon-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing
A publicly verifiable secret sharing scheme is more applicable than a verifiable secret sharing because of the property that the validity of the shares distributed by the dealer can be verified by any party. In this paper, we construct a non-interactive and informationtheoretic publicly verifiable secret sharing by a computationally binding and unconditionally hiding commitment scheme and zero-...
متن کاملInformation Flow in Secret Sharing Protocols
The entangled graph states [9] have emerged as an elegant and powerful quantum resource, indeed almost all multiparty protocols can be written in terms of graph states including measurement based quantum computation (MBQC), error correction and secret sharing amongst others. In addition they are at the forefront in terms of implementations. As such they represent an excellent opportunity to mov...
متن کاملInformation-theoretically Secure Strong Verifiable Secret Sharing
In a (t,n) secret sharing scheme, a mutually trusted dealer divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. When there is no mutually trusted dealer, a (n,t,n) secret sharing scheme can be used to set up a (t,n) secret sharing because each shareholder also acts as a dealer to decide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2162183